منابع مشابه
Generalized Topological Sorting in Linear Time
The generalized topologica.l sorting problem takes a.s input a positive integer /c and a directed, acyclic graph with some vertices labded by positive integers, and the goa.l is to labd the remaining vertices by positive integers in such a way that each edge leads !rom a lower-Iabeled vertex to a higher-Iabded vertex, and such that the set of labds used is exactly {l, ... ,/c}. Given a generali...
متن کاملLinear Time Sorting of Skewed Distributions
This work presents an eecient linear average time algorithm to sort lists of integers that follow skewed distributions. It also studies a particular case where the list follows the Zipf's distribution, and presents a example application where the algorithm is used to reduce the time to build word-based Huuman codes.
متن کاملAnalysis of Linear Time Sorting Algorithms
We derive CPU time formulae for the two simplest linear time-sorting algorithms, linear probing sort and bucket sort, as a function of the load factor, and show agreement with experimentally measured CPU times. This allows us to compute optimal load factors for each algorithm, whose values have previously been identified only approximately in the literature. We also present a simple model of ca...
متن کاملOn the Time-Space Tradeoff for Sorting with Linear Queries
Extending a result of Borodin, et. al. [l], we show that any branching program using linear queries " rhixi: c " to sort n numibers i ⌧pp l **,⌧n must satisfy the time-space tradeoff relation TS = n(n*) , The same relation is also shown to be true for branching programs that uses queries " min R = ? " where R is any subset of {xl,x2,...,xnj .
متن کاملMerge Sort: Awards sorting algorithm with approximate linear time complexity
Bingheng Wang Dept. of Computer Science Florida Institute of Technology Melbourne FL 32904 [email protected] ABSTRACT Given a list of elements, we rearrange the list with ascending or descending order. So far the existing approaches involve Bubble Sort, Insertion Sort, Selection Sort ( respectively in worst case) performing slow. Now we introduce a new algorithm Merge Sort to solve the problem ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1998
ISSN: 0022-0000
DOI: 10.1006/jcss.1998.1580